Noise Performance of Second-Order Bidirectional Associative Memory
نویسندگان
چکیده
This paper describes the error probability of the second order BAM estimated by a computer simulation and an analytical calculation method. The computer simulation suggests that the iterations to retrieve a library pattern almost converge within four times and the difference between once and twice is much larger than that between twice and four times. The error probability at the output of the second iteration is estimated by the analytical method. The effect of the noise bits is also estimated using the analytical method. The BAM with larger n is more robust for the noise. For example, the noise bits of 0.15n cause almost no degradation of the error probability when n is larger than 100. If the error probability of 10−4 is allowable, the capacity of the second order BAM can be increased by about 40% in the presence of 0.15n noise bits when n is larger than 500. key words: BAM, noise, capacity, error probability, characteristic function, Hermite Gauss
منابع مشابه
Stability and statistical properties of second-order bidirectional associative memory
In this paper, a bidirectional associative memory (BAM) model with second-order connections, namely second-order bidirectional associative memory (SOBAM), is first reviewed. The stability and statistical properties of the SOBAM are then examined. We use an example to illustrate that the stability of the SOBAM is not guaranteed. For this result, we cannot use the conventional energy approach to ...
متن کاملBidirectional Retrieval from Associative Memory
Similarity based fault tolerant retrieval in neural associative memories (N AM) has not lead to wiedespread applications. A drawback of the efficient Willshaw model for sparse patterns [Ste61, WBLH69], is that the high asymptotic information capacity is of little practical use because of high cross talk noise arising in the retrieval for finite sizes. Here a new bidirectional iterative retrieva...
متن کاملGeneralized Asymmetrical Bidirectional Associative Memory*
A classical bidirectional associative memory (BAM) suffers from low storage capacity and abundance of spurious memories though it has the properties of good generalization and noise immunity. In this paper, Hamming distance in recall procedure of usual asymmetrical BAM is replaced with modified Hamming distance by introducing weighting matrix into connection matrix. This generalization is valid...
متن کاملA Chaotic Bidirectional Associative Memory
A new BAM model is presented that uses a chaotic output function operating in chaotic mode during recall. Our results show that the model develops well-defined attractor basins, with the result that our chaotic BAM is more tolerant to noise than a regular fixed point BAM. This is concluded from simulations that showed the superior performance of the new model when compared to the original BAM a...
متن کاملPii: S0893-6080(98)00125-7
The Willshaw model is asymptotically the most efficient neural associative memory (NAM), but its finite version is hampered by high retrieval errors. Iterative retrieval has been proposed in a large number of different models to improve performance in auto-association tasks. In this paper, bidirectional retrieval for the hetero-associative memory task is considered: we define information effici...
متن کامل